Optimal Tableaux Method for Constructive Satisfiability Testing and Model Synthesis in the Alternating-time Temoral Logic ATL+
نویسنده
چکیده
منابع مشابه
Optimal Tableaux-Based Decision Procedure for Testing Satisfiability in the Alternating-Time Temporal Logic ATL+
We develop a sound, complete and practically implementable tableaux-based decision method for constructive satisfiability testing and model synthesis in the fragment ATL of the full Alternating time temporal logic ATL∗. The method extends in an essential way a previously developed tableaux-based decision method for ATL and works in 2EXPTIME, which is the optimal worst case complexity of the sat...
متن کاملSatisfiability of Alternating-Time Temporal Epistemic Logic Through Tableaux
In this paper we present a tableau-based method to decide the satisfiability of formulas in ATEL, an extension of the alternating-time temporal logic ATL including epistemic modalities for individual knowledge. Specifically, we analyse satisfiability of ATEL formulas under a number of conditions. We evaluate the assumptions of synchronicity and of a unique initial state, which have been propose...
متن کاملFrom ATL Tableaux to Alternating Automata
The logic called ATL (Alternating-time Temporal Logic) was introduced, in 1997, as a modal logic of agents. The first direct algorithm to test whether a given ATL-formula θ is satisfiable was provided by V. Goranko and G. van Drimmelen in 2006. Their algorithm is based on alternating infinite tree automata. In 2009, V. Goranko and D. Shkatov proposed a method to test satisfiability of a formula...
متن کاملDeciding ATL∗ Satisfiability by Tableaux Technical report
We propose a tableau-based decision procedure for the full Alternating-time Temporal Logic ATL∗. We extend our procedure for ATL in order to deal with nesting of temporal operators. As a side effect, we obtain a new and conceptually simple tableau method for CTL∗. The worst case complexity of our procedure is 2EXPTIME. Our method is human-readable and easily implementable. A web application and...
متن کاملOptimal Decision Procedures for Satisfiability in Fragments of Alternating-time Temporal Logics
We consider several natural fragments of the alternating-time temporal logics ATL* and ATL with restrictions on the nesting between temporal operators and strategic quantifiers. We develop optimal decision procedures for satisfiability in these fragments, showing that they have much lower complexities than the full languages. In particular, we prove that the satisfiability problem for state for...
متن کامل